Critical Probabilities of 1-Independent Percolation Models

نویسندگان

  • Paul N. Balister
  • Béla Bollobás
چکیده

Given a locally finite connected infinite graph G, let the interval [pmin(G), pmax(G)] be the smallest interval such that if p > pmax(G) then every 1-independent bond percolation model on G with bond probability p percolates, and for p < pmin(G) none does. We determine this interval for trees in terms of the branching number of the tree. We also give some general bounds for other graphs G, in particular for lattices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subcritical U-bootstrap Percolation Models Have Non-trivial Phase Transitions

We prove that there exist natural generalizations of the classical bootstrap percolation model on Z that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Van Enter [28] (in the case d = r = 2) and Schonmann [25] (for all d > r > 2) proved that r-neighbour bootstrap percolation models have trivial critical probabili...

متن کامل

Scaling Limit and Critical Exponents for Two-Dimensional Bootstrap Percolation

Consider a cellular automaton with state space {0, 1}Z2 where the initial configuration ω0 is chosen according to a Bernoulli product measure, 1’s are stable, and 0’s become 1’s if they are surrounded by at least three neighboring 1’s. In this paper we show that the configuration ωn at time n converges exponentially fast to a final configuration ω̄, and that the limiting measure corresponding to...

متن کامل

Inequalities and Entanglements for Percolation and Random-cluster Models

We discuss inequalities and applications for percolation and randomcluster models. The relevant areas of methodology concern the following two types of inequality: inequalities involving the probability of a general increasing event, and certain differential inequalities involving the percolation probability. We summarise three areas of application of such inequalities, namely strict inequality...

متن کامل

Universality in two-dimensional enhancement percolation

We consider a type of dependent percolation introduced in [2], where it is shown that certain “enhancements” of independent (Bernoulli) percolation, called essential, make the percolation critical probability strictly smaller. In this paper we first prove that, for two-dimensional enhancements with a natural monotonicity property, being essential is also a necessary condition to shift the criti...

متن کامل

Improved Bounds on Metastability Thresholds and Probabilities for Generalized Bootstrap Percolation

We generalize and improve results of Andrews, Gravner, Holroyd, Liggett, and Romik on metastability thresholds for generalized two-dimensional bootstrap percolation models, and answer several of their open problems and conjectures. Specifically, we prove slow convergence and localization bounds for Holroyd, Liggett, and Romik’s k-percolation models, and in the process provide a unified and impr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2012